Doing logic by computer: interpolation in fragments of intuitionistic propositional logic
نویسندگان
چکیده
منابع مشابه
Interpolation in Fragments of Intuitionistic Propositional Logic
Let NNIL (No Nestings of Implication to the Left) be the fragment of IpL (intuitionistic propositional logic) in which the antecedent of any implication is always prime. The following strong interpolation theorem is proved: if IpL }-A+B and A or B is in NNIL, then there is an interpolant I in KNIT The proof consists in constructing I from a proof of A+B in a sequent calculus system by means of ...
متن کاملIntuitionistic Propositional Logic with Only Equivalence Has No Interpolation
We will show in this paper that there is no interpolation theorem for the fragment of pure equivalence in intuitionistic propositional logic. The computer program that was used to calculate the counterexample by computations on a nite Kripke model is brieey sketched.
متن کاملSemantics of intuitionistic propositional logic
Intuitionistic logic is a weakening of classical logic by omitting, most prominently, the principle of excluded middle and the reductio ad absurdum rule. As a consequence, this logic has a wider range of semantical interpretations. The motivating semantics is the so called Brouwer-Heyting-Kolmogorov interpretation of logic. The propositions A,B,C, . . . are regarded as problems or tasks to be s...
متن کاملBisimulation and Propositional Intuitionistic Logic
The Brouwer-Heyting-Kolmogorov interpretation of intuition-istic logic suggests that p q can be interpreted as a computation that given a proof of p constructs a proof of q. Dually, we show that every nite canonical model of q contains a nite canonical model of p. If q and p are interderivable, their canonical models contain each other. Using this insight, we are able to characterize validity i...
متن کاملProof Complexity of Intuitionistic Propositional Logic
We explore the proof complexity of intuitionistic propositional logic (IPL). The problem of determining whether or not an intuitionistic formula is valid is PSPACE-Complete via a reduction from QBF . In view of this reduction (due to Statman), it is natural to compare the proof-theoretic strength of a standard axiomatic system for IPL with a similar proof system for classical quantified Boolean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2000
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(00)00009-9